Research on task assignment to minimize travel cost for spatio-temporal crowdsourcing

Abstract Online task assignment is one of the core research issues spatio-temporal crowdsourcing technology. The current researches on minimizing travel cost all focus scenario two objectives (task requesters and workers). This paper proposes a two-stage framework (GH) based Greedy algorithm Hungarian for three-objective online to minimize cost. In order further optimize efficiency average cost, this GH-AT (Adaptive Threshold) GH algorithm, redesigns into sHungarian algorithm. has lower time complexity than not only suitable problem studied in paper, but also problems with constraints. Compared higher total utility. terms number matches, slightly much